COMPUTING SCIENCE Logic Decomposition of Asynchronous Circuits Using STG Unfoldings
نویسندگان
چکیده
A technique for logic decomposition of asynchronous circuits which works on STG unfolding prefixes rather than state graphs is proposed. It retains all the advantages of the state space based approach, such as the possibility of multiway acknowledgement, latch utilisation and highly optimised circuits. Moreover, it significantly alleviates the state space explosion, and thus has superior memory consumption and runtime. © 2010 University of Newcastle upon Tyne. Printed and published by the University of Newcastle upon Tyne, Computing Science, Claremont Tower, Claremont Road, Newcastle upon Tyne, NE1 7RU, England. Bibliographical details
منابع مشابه
Interactive Resolution of Encoding Conflicts in Asynchronous Circuits Based on STG Unfoldings
The synthesis of asynchronous circuits from STGs involves the resolution of encoding conflicts by means of refining the STG specification. The refinement process is generally done automatically using heuristics and offers little or no feedback to the designer making it difficult to intervene. Better synthesis solutions are obtained by involving human knowledge into the process. A framework is p...
متن کاملCombining Decomposition and Unfolding for STG Synthesis
For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In this paper, we present a combined approach to alleviate it, based on using Petri net unfoldings and decomposition. The experimental results show significant improvement in terms of runtime compared with other existing methods.
متن کاملSTG Decomposition and Its Correctness∗
The behaviour of asynchronous control circuits can be specified with Signal Transition Graphs (STGs), i.e. Petri nets where transitions are labelled with rising and falling edges of circuit signals. Speed independent (SI) circuits (an important and robust subclass of asynchronous circuits) can be synthesized from STGs with tools like PETRIFY [3] and PUNF&MPSAT [6]. For this purpose, PETRIFY bui...
متن کاملAttacking complexity in logic synthesis of asynchronous circuits
Most of the microelectronic circuits fabricated today are synchronous, i.e. they are driven by one or several clock signals. Synchronous circuit design faces several fundamental challenges such as high-speed clock distribution, integration of multiple cores operating at different clock rates, reduction of power consumption and dealing with voltage, temperature, manufacturing and runtime variati...
متن کاملSTG-Level Decomposition and Resynthesis of Speed-Independent Circuits
This paper presents a time-efficient method for the decomposition and resynthesis of speed-independent (SI) circuits. Given the specification of an SI circuit, our method first generates its standard C implementation. Then, the combinational decomposition is performed to decompose each high-fanin gate that does not exist in the gate library into some available low-fanin gates. The time efficien...
متن کامل